منابع مشابه
Ensuring Correctness of Model Transformations
This paper is concerned with the interplay of the expressiveness of model and graph transformation languages, of assertion formalisms making correctness statements about transformations, and the decidability of the resulting verification problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that ...
متن کاملOn the Correctness of Model Transformations
Flight-critical aviation software today is often being developed using ‘model-based’ techniques. The industry-standard tools for such development are widely available, and they typically include a visual modeling language (supporting dataflow-style and statechart-style modeling paradigms), a simulation engine, and a code-generator that produces embedded code from the diagrams. The modeling lang...
متن کاملProving the Correctness of Program Transformations
Given a formal specification S of a problem, we wish to obtain a computer program that solves this problem. The traditional approach used to obtain such a program has been to give the formal specification to a programmer. The programmer’s task is to study the specification, and after he fully understands it, to write a computer program satisfying the specification. For critical applications, fo...
متن کاملDiscovery and Correctness of Schema Mapping Transformations
Schema mapping is becoming pervasive in all data transformation, exchange and integration tasks. It brings to the surface the problem of differences and mismatches between heterogeneous formats and models, respectively used in source and target databases to be mapped one to another. In this chapter, we start by describing the problem of schema mapping, its background and technical implications....
متن کاملCorrectness of effect-based program transformations
We consider a type system capable of tracking reading, writing and allocation in a higher-order language with dynamically allocated references. We give a denotational semantics to this type system which allows us to validate a number of effect-dependent program equivalences in the sense of observational equivalence. An example is the following: x = e; y = e; e′(x, y) is equivalent to x = e; e′(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90083-3